TSTP Solution File: SET063^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET063^4 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:17:42 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 26
% Syntax : Number of formulae : 52 ( 22 unt; 15 typ; 0 def)
% Number of atoms : 106 ( 12 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 308 ( 23 ~; 17 |; 10 &; 250 @)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 57 ( 57 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 4 con; 0-3 aty)
% Number of variables : 75 ( 38 ^ 37 !; 0 ?; 75 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
thf(decl_23,type,
mactual: mworld ).
thf(decl_24,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_25,type,
mnot: ( mworld > $o ) > mworld > $o ).
thf(decl_26,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_28,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_29,type,
mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_32,type,
mforall_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_34,type,
empty_set: $i ).
thf(decl_36,type,
equal_set: $i > $i > mworld > $o ).
thf(decl_37,type,
member: $i > $i > mworld > $o ).
thf(decl_38,type,
subset: $i > $i > mworld > $o ).
thf(decl_42,type,
intersection: $i > $i > $i ).
thf(decl_47,type,
esk1_2: $i > $i > $i ).
thf(decl_50,type,
esk4_0: $i ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ByVFI5KxUc/E---3.1_23362.p',mlocal_def) ).
thf(mnot_def,axiom,
( mnot
= ( ^ [X2: mworld > $o,X3: mworld] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ByVFI5KxUc/E---3.1_23362.p',mnot_def) ).
thf(mforall_di_def,axiom,
( mforall_di
= ( ^ [X7: $i > mworld > $o,X3: mworld] :
! [X8: $i] : ( X7 @ X8 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ByVFI5KxUc/E---3.1_23362.p',mforall_di_def) ).
thf(mimplies_def,axiom,
( mimplies
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ByVFI5KxUc/E---3.1_23362.p',mimplies_def) ).
thf(mequiv_def,axiom,
( mequiv
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
<=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ByVFI5KxUc/E---3.1_23362.p',mequiv_def) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ByVFI5KxUc/E---3.1_23362.p',mand_def) ).
thf(empty_set_0,axiom,
( mlocal
@ ( mforall_di
@ ^ [X8: $i] : ( mnot @ ( member @ X8 @ empty_set ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ByVFI5KxUc/E---3.1_23362.p',empty_set_0) ).
thf(subset_0,axiom,
( mlocal
@ ( mforall_di
@ ^ [X49: $i] :
( mforall_di
@ ^ [X50: $i] :
( mequiv @ ( subset @ X49 @ X50 )
@ ( mforall_di
@ ^ [X8: $i] : ( mimplies @ ( member @ X8 @ X49 ) @ ( member @ X8 @ X50 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ByVFI5KxUc/E---3.1_23362.p',subset_0) ).
thf(intersection_0,axiom,
( mlocal
@ ( mforall_di
@ ^ [X8: $i] :
( mforall_di
@ ^ [X54: $i] :
( mforall_di
@ ^ [X55: $i] : ( mequiv @ ( member @ X8 @ ( intersection @ X54 @ X55 ) ) @ ( mand @ ( member @ X8 @ X54 ) @ ( member @ X8 @ X55 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ByVFI5KxUc/E---3.1_23362.p',intersection_0) ).
thf(thI17,conjecture,
( mlocal
@ ( mforall_di
@ ^ [X66: $i] : ( equal_set @ ( intersection @ X66 @ empty_set ) @ empty_set ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ByVFI5KxUc/E---3.1_23362.p',thI17) ).
thf(equal_set_0,axiom,
( mlocal
@ ( mforall_di
@ ^ [X51: $i] :
( mforall_di
@ ^ [X52: $i] : ( mequiv @ ( equal_set @ X51 @ X52 ) @ ( mand @ ( subset @ X51 @ X52 ) @ ( subset @ X52 @ X51 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ByVFI5KxUc/E---3.1_23362.p',equal_set_0) ).
thf(c_0_11,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_12,plain,
( mnot
= ( ^ [Z0: mworld > $o,Z1: mworld] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot_def]) ).
thf(c_0_13,plain,
( mforall_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
! [X8: $i] : ( Z0 @ X8 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_di_def]) ).
thf(c_0_14,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_15,plain,
( mequiv
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
<=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mequiv_def]) ).
thf(c_0_16,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_17,plain,
! [X140: $i] :
~ ( member @ X140 @ empty_set @ mactual ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[empty_set_0]),c_0_11]),c_0_12]),c_0_13])]) ).
thf(c_0_18,plain,
! [X129: $i,X128: $i] :
( ( subset @ X129 @ X128 @ mactual )
<=> ! [X127: $i] :
( ( member @ X127 @ X129 @ mactual )
=> ( member @ X127 @ X128 @ mactual ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[subset_0]),c_0_11]),c_0_14]),c_0_15]),c_0_13]) ).
thf(c_0_19,plain,
! [X136: $i,X135: $i,X134: $i] :
( ( member @ X136 @ ( intersection @ X135 @ X134 ) @ mactual )
<=> ( ( member @ X136 @ X135 @ mactual )
& ( member @ X136 @ X134 @ mactual ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[intersection_0]),c_0_11]),c_0_16]),c_0_15]),c_0_13]) ).
thf(c_0_20,negated_conjecture,
~ ! [X155: $i] : ( equal_set @ ( intersection @ X155 @ empty_set ) @ empty_set @ mactual ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thI17])]),c_0_11]),c_0_13]) ).
thf(c_0_21,plain,
! [X131: $i,X130: $i] :
( ( equal_set @ X131 @ X130 @ mactual )
<=> ( ( subset @ X131 @ X130 @ mactual )
& ( subset @ X130 @ X131 @ mactual ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[equal_set_0]),c_0_11]),c_0_16]),c_0_15]),c_0_13]) ).
thf(c_0_22,plain,
! [X232: $i] :
~ ( member @ X232 @ empty_set @ mactual ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_17])]) ).
thf(c_0_23,plain,
! [X216: $i,X217: $i,X218: $i,X219: $i,X220: $i] :
( ( ~ ( subset @ X216 @ X217 @ mactual )
| ~ ( member @ X218 @ X216 @ mactual )
| ( member @ X218 @ X217 @ mactual ) )
& ( ( member @ ( esk1_2 @ X219 @ X220 ) @ X219 @ mactual )
| ( subset @ X219 @ X220 @ mactual ) )
& ( ~ ( member @ ( esk1_2 @ X219 @ X220 ) @ X220 @ mactual )
| ( subset @ X219 @ X220 @ mactual ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])])]) ).
thf(c_0_24,plain,
! [X226: $i,X227: $i,X228: $i] :
( ( ( member @ X226 @ X227 @ mactual )
| ~ ( member @ X226 @ ( intersection @ X227 @ X228 ) @ mactual ) )
& ( ( member @ X226 @ X228 @ mactual )
| ~ ( member @ X226 @ ( intersection @ X227 @ X228 ) @ mactual ) )
& ( ~ ( member @ X226 @ X227 @ mactual )
| ~ ( member @ X226 @ X228 @ mactual )
| ( member @ X226 @ ( intersection @ X227 @ X228 ) @ mactual ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
thf(c_0_25,negated_conjecture,
~ ( equal_set @ ( intersection @ esk4_0 @ empty_set ) @ empty_set @ mactual ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
thf(c_0_26,plain,
! [X222: $i,X223: $i] :
( ( ( subset @ X222 @ X223 @ mactual )
| ~ ( equal_set @ X222 @ X223 @ mactual ) )
& ( ( subset @ X223 @ X222 @ mactual )
| ~ ( equal_set @ X222 @ X223 @ mactual ) )
& ( ~ ( subset @ X222 @ X223 @ mactual )
| ~ ( subset @ X223 @ X222 @ mactual )
| ( equal_set @ X222 @ X223 @ mactual ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
thf(c_0_27,plain,
! [X8: $i] :
~ ( member @ X8 @ empty_set @ mactual ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_28,plain,
! [X8: $i,X10: $i] :
( ( member @ ( esk1_2 @ X8 @ X10 ) @ X8 @ mactual )
| ( subset @ X8 @ X10 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_29,plain,
! [X8: $i,X11: $i,X10: $i] :
( ( member @ X8 @ X10 @ mactual )
| ~ ( member @ X8 @ ( intersection @ X11 @ X10 ) @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_30,negated_conjecture,
~ ( equal_set @ ( intersection @ esk4_0 @ empty_set ) @ empty_set @ mactual ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_31,plain,
! [X10: $i,X8: $i] :
( ( equal_set @ X8 @ X10 @ mactual )
| ~ ( subset @ X8 @ X10 @ mactual )
| ~ ( subset @ X10 @ X8 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_32,plain,
! [X8: $i] : ( subset @ empty_set @ X8 @ mactual ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_33,plain,
! [X8: $i,X10: $i,X11: $i] :
( ( member @ ( esk1_2 @ ( intersection @ X8 @ X10 ) @ X11 ) @ X10 @ mactual )
| ( subset @ ( intersection @ X8 @ X10 ) @ X11 @ mactual ) ),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
thf(c_0_34,negated_conjecture,
~ ( subset @ ( intersection @ esk4_0 @ empty_set ) @ empty_set @ mactual ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
thf(c_0_35,plain,
! [X8: $i,X10: $i] : ( subset @ ( intersection @ X8 @ empty_set ) @ X10 @ mactual ),
inference(spm,[status(thm)],[c_0_27,c_0_33]) ).
thf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET063^4 : TPTP v8.1.2. Released v8.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n010.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Fri May 3 10:10:33 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.ByVFI5KxUc/E---3.1_23362.p
% 0.20/0.51 # Version: 3.1.0-ho
% 0.20/0.51 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.51 # Starting new_ho_12 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_2 with 300s (1) cores
% 0.20/0.51 # new_ho_10_cnf2 with pid 23466 completed with status 0
% 0.20/0.51 # Result found by new_ho_10_cnf2
% 0.20/0.51 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: HGHNS-FFMF21-SHSSMFNN
% 0.20/0.51 # partial match(1): HGUNS-FFMF21-SHSSMFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting new_ho_10 with 811s (1) cores
% 0.20/0.51 # Starting new_ho_10_cnf2 with 151s (1) cores
% 0.20/0.51 # Starting ho_unfolding_6 with 136s (1) cores
% 0.20/0.51 # Starting sh4l with 136s (1) cores
% 0.20/0.51 # Starting ehoh_best_nonlift_rwall with 136s (1) cores
% 0.20/0.51 # sh4l with pid 23476 completed with status 0
% 0.20/0.51 # Result found by sh4l
% 0.20/0.51 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: HGHNS-FFMF21-SHSSMFNN
% 0.20/0.51 # partial match(1): HGUNS-FFMF21-SHSSMFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting new_ho_10 with 811s (1) cores
% 0.20/0.51 # Starting new_ho_10_cnf2 with 151s (1) cores
% 0.20/0.51 # Starting ho_unfolding_6 with 136s (1) cores
% 0.20/0.51 # Starting sh4l with 136s (1) cores
% 0.20/0.51 # Preprocessing time : 0.002 s
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 71
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 79
% 0.20/0.51 # Removed in clause preprocessing : 26
% 0.20/0.51 # Initial clauses in saturation : 53
% 0.20/0.51 # Processed clauses : 80
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 1
% 0.20/0.51 # ...remaining for further processing : 79
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 1
% 0.20/0.51 # Generated clauses : 297
% 0.20/0.51 # ...of the previous two non-redundant : 277
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 293
% 0.20/0.51 # Factorizations : 4
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 3
% 0.20/0.51 # ...of those cached : 0
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 78
% 0.20/0.51 # Positive orientable unit clauses : 13
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 9
% 0.20/0.51 # Non-unit-clauses : 56
% 0.20/0.51 # Current number of unprocessed clauses: 250
% 0.20/0.51 # ...number of literals in the above : 628
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 1
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 588
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 557
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 143
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 9
% 0.20/0.51 # BW rewrite match successes : 1
% 0.20/0.51 # Condensation attempts : 80
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 14635
% 0.20/0.51 # Search garbage collected termcells : 4298
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.019 s
% 0.20/0.51 # System time : 0.005 s
% 0.20/0.51 # Total time : 0.024 s
% 0.20/0.51 # Maximum resident set size: 2632 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.061 s
% 0.20/0.51 # System time : 0.019 s
% 0.20/0.51 # Total time : 0.080 s
% 0.20/0.51 # Maximum resident set size: 1832 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------